Neural Network in Fixed Time for Collision Detection between Two Convex Polyhedra

نویسندگان

  • M. Khouil
  • N. Saber
  • M. Mestari
چکیده

In this paper, a different architecture of a collision detection neural network (DCNN) is developed. This network, which has been particularly reviewed, has enabled us to solve with a new approach the problem of collision detection between two convex polyhedra in a fixed time (O (1) time). We used two types of neurons, linear and threshold logic, which simplified the actual implementation of all the networks proposed. The study of the collision detection is divided into two sections, the collision between a point and a polyhedron and then the collision between two convex polyhedra. The aim of this research is to determine through the AMAXNET network a mini maximum point in a fixed time, which allows us to detect the presence of a potential collision. Keywords—Collision identification, fixed time, convex polyhedra, neural network, AMAXNET.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhancing GJK: computing minimum and penetration distances between convex polyhedra

The problem of tracking the distance between two convex polyhedra is nding applications in many areas of robotics, including intersection detection, collision detection , and path planning. We present new results that connrm an almost-constant time complexity for an enhanced version of Gilbert, Johnson and Keerthi's algorithm, and also describe modiications to the algorithm to compute measures ...

متن کامل

A Fast Algorithm for Incremental Distance Calculation

A simple and efficient algorithm for finding the closest points between two convex polyhedra is described here. Data from numerous experiments tested on a broad set of convex polyhedra on !X3 show that the running time is roughly constant for finding closest points when nearest points are approximately known and is linear in total number of vertices if no special initialization is done. This al...

متن کامل

Collision Detection of Convex Polyhedra Based on Duality Transformation

Collision detection is an essential problem in many applications in computer graphics, CAD/CAM, and robotics. In this paper, a new method, called CD-Dual, for detecting collision between two convex polyhedra is proposed. The idea is based on a local search among the faces on the Minkowski difference (M) of the polyhedra. The local search is guided by a simple signed distance function defined on...

متن کامل

Critique for CS 448B: Topics in Modeling The Voronoi-clip Collision Detection Algorithm

This paper presents the Voronoi-clip (V-clip) algorithm for polyhedral collision detection. The method is similar to that of the Lin-Canny algorithm [1] in that it tracks the closest pair of features between two polyhedra. However, the V-clip method offers superior robustness, requires less complex code, can better handle penetrating polyhedra, and is more useful for collision detection between...

متن کامل

Quick Elimination of Non Interference Polytopes in Virtual Environments

The problem of collision detection is fundamental to interactive appli cations such as computer animation and virtual environments In these elds prompt recognition of possible impacts is important for computing real time response However existing algorithms do not eliminate non interfence objects e ciently This paper presents a practical algorithm to quickly eliminate most non interference conv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014